package findtree;

import java.util.function.BinaryOperator;

public class Test {

    public static void main(String[] args) {



        BinarySearchTree binarySearchTree  = new BinarySearchTree();
        boolean insert = binarySearchTree.insert(10);
        binarySearchTree.insert(15);
        binarySearchTree.insert(6);
        binarySearchTree.insert(5);
        binarySearchTree.insert(9);
         binarySearchTree.insert(11);
        binarySearchTree.insert(11);

//        System.out.println(binarySearchTree.search(7));
//        System.out.println(binarySearchTree.search(13));
        System.out.println(binarySearchTree);

        binarySearchTree.remove(11);
        binarySearchTree.remove(6);
        System.out.println();

    }
}
